Inexact gradient projection method with relative error tolerance
نویسندگان
چکیده
A gradient projection method with feasible inexact projections is proposed in the present paper. The performed using a general relative error tolerance. Asymptotic convergence analysis under quasiconvexity assumption and iteration-complexity bounds convexity of employing constant Armijo step sizes are presented. Numerical results reported illustrating potential advantages considering instead exact ones some medium scale instances least squares problem over spectrohedron.
منابع مشابه
A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance
We prove that under semi-local assumptions, the inexact Newton method with a fixed relative residual error tolerance converges Q-linearly to a zero of the non-linear operator under consideration. Using this result we show that Newton method for minimizing a self-concordant function or to find a zero of an analytic function can be implemented with a fixed relative residual error tolerance. In th...
متن کاملLocal convergence analysis of Inexact Newton method with relative residual error tolerance under majorant condition in Riemannian manifolds
A local convergence analysis of Inexact Newton’s method with relative residual error tolerance for finding a singularity of a differentiable vector field defined on a complete Riemannian manifold, based on majorant principle, is presented in this paper. We prove that under local assumptions, the inexact Newton method with a fixed relative residual error tolerance converges Q -linearly to a sing...
متن کاملInexact Gradient Projection and Fast Data Driven Compressed Sensing
We study convergence of the iterative projected gradient (IPG) algorithm for arbitrary (possibly nonconvex) sets and when both the gradient and projection oracles are computed approximately. We consider different notions of approximation of which we show that the Progressive Fixed Precision (PFP) and the (1 + ε)-optimal oracles can achieve the same accuracy as for the exact IPG algorithm. We sh...
متن کاملInexact projected gradient method for vector optimization
In this work, we propose an inexact projected gradient-like method for solving smooth constrained vector optimization problems. In the unconstrained case, we retrieve the steepest descent method introduced by Graña Drummond and Svaiter. In the constrained setting, the method we present extends the exact one proposed by Graña Drummond and Iusem, since it admits relative errors on the search dire...
متن کاملInexact Preconditioned Conjugate Gradient Method with Inner-Outer Iteration
An important variation of preconditioned conjugate gradient algorithms is inexact precon-ditioner implemented with inner-outer iterations 5], where the preconditioner is solved by an inner iteration to a prescribed precision. In this paper, we formulate an inexact preconditioned conjugate gradient algorithm for a symmetric positive deenite system and analyze its convergence property. We establi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2022
ISSN: ['0926-6003', '1573-2894']
DOI: https://doi.org/10.1007/s10589-022-00425-4